翻訳と辞書 Words near each other ・ Gilbertsonia ・ Gilbertstone ・ Gilbertsville ・ Gilbertsville Academy ・ Gilbertsville Historic District ・ Gilbertsville, Kentucky ・ Gilbertsville, New York ・ Gilbertsville, Pennsylvania ・ Gilbertus Anglicus ・ Gilbertus Happart ・ Gilbertville ・ Gilbertville Historic District ・ Gilbertville, Iowa ・ Gilbertville, Maine ・ Gilbertville, Massachusetts ・ Gilbert–Johnson–Keerthi distance algorithm ・ Gilbert–Shannon–Reeds model ・ Gilbert–Varshamov bound ・ Gilbey ・ Gilbey baronets ・ Gilbey's Cottages Halt railway station ・ Gilbirds, Illinois ・ Gilboa ・ Gilboa Formation ・ Gilboa Fossil Forest ・ Gilboa Methodist Church ・ Gilboa Regional Council ・ Gilboa Township, Benton County, Indiana ・ Gilboa, New York ・ Gilboa, Ohio Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Gilbert–Johnson–Keerthi distance algorithm ： ウィキペディア英語版 Gilbert–Johnson–Keerthi distance algorithm The Gilbert–Johnson–Keerthi distance algorithm is a method of determining the minimum distance between two convex sets. Unlike many other distance algorithms, it does not require that the geometry data be stored in any specific format, but instead relies solely on a support function to iteratively generate closer simplices to the correct answer using the Minkowski sum (CSO) of two convex shapes. "Enhanced GJK" algorithms use edge information to speed up the algorithm by following edges when looking for the next simplex. This improves performance substantially for polytopes with large numbers of vertices. GJK algorithms are often used incrementally in simulation systems and video games. In this mode, the final simplex from a previous solution is used as the initial guess in the next iteration, or "frame". If the positions in the new frame are close to those in the old frame, the algorithm will converge in one or two iterations. This yields collision detection systems which operate in near-constant time. The algorithm's stability, speed, and small storage footprint make it popular for realtime collision detection, especially in physics engines for video games. == Overview == GJK relies on two functions: * $Support(shape,\; \backslash vec)$, which returns the point on $shape$ which has the highest dot product with $\backslash vec$. * $NearestSimplex(s)$, which takes a simplex $s$ and returns the simplex on $s$ closest to the origin, and a direction toward the origin normal to the new simplex. If $s$ itself contains the origin, $NearestSimplex$ accepts $s$ and the two shapes are determined to intersect. The simplices handled by $NearestSimplex$ may each be any simplex sub-space of . For example in 3D, they may be a point, a line segment, a triangle, or a tetrahedron; each defined by 1, 2, 3, or 4 points respectively. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Gilbert–Johnson–Keerthi distance algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.